A Monotonicity Result for the Blocking Probability in a G/GI/c/m Queueing System
نویسندگان
چکیده
We prove a slightly more general version of the following: In a G/GI/c/m queueing system where arriving customers are randomly deleted with probability 1 − p, the blocking probability of the remaining customers must be non-decreasing in p. In particular, we show that if more customers are accepted, even with a possibly different service time distribution, the blocking probability is at least as large.
منابع مشابه
Performance Evaluation and Dimensioning of GI/M/c/N Systems through Kernel Estimation
We extend the analysis of queueing systems for real-life situations, where the arrival pattern of customers is unknown. In real systems, we must understand how the choice of a method of estimation influences the configuration of the system. Using kernel smoothing, we evaluate algorithms to estimate performance measures of a GI/M/c/N system, including the invariant probability distribution of th...
متن کاملPerformance Evaluation and Dimensioning of GIX/M/c/N Systems through Kernel Estimation
We extend the analysis of queueing systems for real-life situations, where the arrival pattern of customers is unknown. In real systems, we must understand how the choice of a method of estimation influences the configuration of the system. Using kernel smoothing, we evaluate algorithms to estimate performance measures of a GI/M/c/N system, including the invariant probability distribution of th...
متن کاملPerformance evaluation and dimensioning
We extend the analysis of queueing systems for real-life situations where the arrival pattern of customers is unknown. In real systems, we must understand how the choice of a method of estimation influences the configuration of the system. Using kernel smoothing, we evaluate algorithms to estimate performance measures of a GI X /M/c/N system, including the invariant probability distribution of ...
متن کاملAnalysis of M/G/ 1 queueing model with state dependent arrival and vacation
This investigation deals with single server queueing system wherein the arrival of the units follow Poisson process with varying arrival rates in different states and the service time of the units is arbitrary (general) distributed. The server may take a vacation of a fixed duration or may continue to be available in the system for next service. Using the probability argument, we construct the ...
متن کاملM M m K Queue With Additional Servers and Discouragement (RESEARCH NOTE)
Waiting in long queue is undesirable due to which in some practical situations customers become impatient and leave the system. In such cases providing additional servers can reduce long queue. This investigation deals with multi-server queueing system with additional servers and discouragement. The customers arrive in poisson fashion and are served exponentially by a pool of permanent and addi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005